SIAM Journal on Computing -- 1979

By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

© SIAM

SIAM Journal on Computing

Table of Contents

Available Volumes| Issue Index| View myArticles

Search This Issue

Volume 8, Issue 2, pp. 115-285

Please Note: Electronic articles are available well in advance of the printed articles.

Lower Bounds on Synchronous Combinational Complexity

L. H. Harper and J. E. Savage

pp. 115-119

BibTeX Abstract Full Text: PDF

On the Parallel Evaluation of Multivariate Polynomials

pp. 120-123

BibTeX Abstract Full Text: PDF

A New Representation of the Rational Numbers for Fast Easy Arithmetic

E. C. R. Hehner and R. N. S. Horspool

pp. 124-134

BibTeX Abstract Full Text: PDF

Maximum Flow in Planar Networks

Alon Itai and Yossi Shiloach

pp. 135-150

BibTeX Abstract Full Text: PDF

Provably Difficult Combinatorial Games

Larry J. Stockmeyer and Ashok K. Chandra

pp. 151-174

BibTeX Abstract Full Text: PDF

Dynamic Binary Search

pp. 175-198

BibTeX Abstract Full Text: PDF

A Counterexample to Reingold's Pushdown Permuter Characterization Theorem

Carl R. Carlson

pp. 199-201

BibTeX Abstract Full Text: PDF

Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation

E. G. Coffman, Jr. and Joseph Y-T. Leung

pp. 202-217

BibTeX Abstract Full Text: PDF

Equivalences among Relational Expressions

A. V. Aho, Y. Sagiv, and J. D. Ullman

pp. 218-246

BibTeX Abstract Full Text: PDF

Decision Problems for Multivalued Dependencies in Relational Databases

Kenichi Hagihara, Minoru Ito, Kenichi Taniguchi, and Tadao Kasami

pp. 247-264

BibTeX Abstract Full Text: PDF

Bottlenecks and Edge Connectivity in Unsymmetrical Networks

pp. 265-274

BibTeX Abstract Full Text: PDF

Nearly on Line Scheduling of a Uniform Processor System with Release Times

Sartaj Sahni and Yookun Cho

pp. 275-285

BibTeX Abstract Full Text: PDF